The flower intersection problem for S(2,4,v)’s
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Disjoint m-Flower Intersection Problem for Latin Squares
An m-flower in a latin square is a set of m entries which share either a common row, a common column, or a common symbol, but which are otherwise distinct. Two m-flowers are disjoint if they share no common row, column or entry. In this paper we give a solution of the intersection problem for disjoint m-flowers in latin squares; that is, we determine precisely for which triples (n,m, x) there e...
متن کاملThe intersection problem for cubes
For all integers m, nand t, we determine necessary and sufficient conditions for the existence of (1) a pair of 3-cube decompositions of Kn having precisely t common 3-cubes; and (2) a pair of 3-cube decompositions of Km,n having precisely t common 3-cubes.
متن کاملThe unimodular intersection problem
We show that finding minimally intersecting n paths from s to t in a directed graph or n perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
متن کاملThe μ-way intersection problem for cubes
A collection of Il 3-cube decompositions of a graph G is said to have intersection size t if there is a set S, with 181 = t, of 3-cubes which is contained in every decomposition, and no 3-cube which is not in S occurs in more than one decomposition. We determine all integers n, t and Il, with Il ::; 12, for which there exists a collection of Il 3-cube decompositions of Kn with intersection size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.10.012